The Traveling Salesman Problem for Cubic Graphs
نویسندگان
چکیده
منابع مشابه
The Traveling Salesman Problem for Cubic Graphs
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2) ≈ 1.260 and linear space. Our algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound. We can also count or list all Hamiltonian cycles in a degree three graph in time O(2) ≈ 1.297. We also solve the traveling salesman problem in graphs of...
متن کاملThe traveling salesman problem on cubic and subcubic graphs
We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NPhard. The problem is of interest because of its relation to the famous 4/3 conjecture for metric TSP, which says that the integrality gap, i.e., the worst case ratio between the optimal values of the TSP and its linear programming relaxation (the subtour elimination relax...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملA new upper bound for the traveling salesman problem in cubic graphs
We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i. e. graphs with maximum vertex degree three, and prove that the problem for an n-vertex graph can be solved inO(1.2553) time and in linear space. We show that the exact TSP algorithm of Eppstein, with some minor modifications, yields the stated result. The previous best known upper bound O(1.251) was claimed by...
متن کاملSimple cubic graphs with no short traveling salesman tour
Let tsp(G) denote the length of a shortest travelling salesman tour in a graph G. We prove that for any ε > 0, there exists a simple 2-connected planar cubic graph G1 such that tsp(G1) ≥ (1.25 − ε) · |V (G1)|, a simple 2-connected bipartite cubic graph G2 such that tsp(G2) ≥ (1.2 − ε) · |V (G2)|, and a simple 3-connected cubic graph G3 such that tsp(G3) ≥ (1.125− ε) · |V (G3)|.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2007
ISSN: 1526-1719
DOI: 10.7155/jgaa.00137